Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
نویسندگان
چکیده
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing and comparing various methods designed to this purpose. According to Dayar T., Stewart W.J. Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains. SIAM J. Sci. Comput.Vol 21, No. 5, 16911705 (2000), the IAD methods are effective in particular when applied to large ill posed problems. One of the purposes of this paper is to contribute to a possible explanation of this fact. The novelty may consist of the fact that the IAD algorithms do converge independently of whether the iteration matrix of the corresponding process is primitive or not. Some numerical tests are presented and possible applications mentioned; e.g. computing the PageRank.
منابع مشابه
Stair Matrices and Their Generalizations with Applications to Iterative Methods Ii: Iteration Arithmetic and Preconditionings
Iteration arithmetic is formally introduced based on iteration multiplication and αaddition which is a special multisplitting. This part focuses on construction of convergent splittings and approximate inverses for Hermitian positive definite matrices by applying stair matrices, their generalizations and iteration arithmetic. Analysis of the splittings and the approximate inverses is also prese...
متن کاملSome New Comparison Theorems for Double Splittings of Matrices
In this paper, we further investigate the double splitting iterative methods for solving linear systems. Building on the previous work by Song and Song [Convergence for nonnegative double splittings of matrices, Calcolo, (2011) 48: 245-260], some new comparison theorems for the spectral radius of double splittings of matrices under suitable conditions are presented.
متن کاملConvergence Issues in the Theory and Practice of Iterative Aggregation/disagrregation Methods
Iterative aggregation/disaggregation methods (IAD) for computation stationary probability vectors of large scale Markov chains is an efficient tool in practice. However, its convergence theory is still not developed appropriately. Similarly as in other multi-level methods such as multigrid methods the number of relaxations on the fine level of the IAD algorithms that is to be executed plays a v...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملComparison of Convergence of General Stationary Iterative Methods for Singular Matrices
New comparison theorems are presented comparing the asymptotic convergence factor of iterative methods for the solution of consistent (as well as inconsistent) singular systems of linear equations. The asymptotic convergence factor of the iteration matrix T is the quantity γ(T ) = max{|λ|, λ ∈ σ(T ), λ = 1}, where σ(T ) is the spectrum of T . In the new theorems, no restrictions are imposed on ...
متن کامل